Multidimensional matching ∗
نویسندگان
چکیده
We present general mathematical methods used in the study of multidimensional matching problems with transferable utility, paying particular attention to the case in which the dimensions of heterogeneity on the two sides of the market are unequal. We then describe an approach to solve a new subclass of these problems: problems where agents on one side of the market are multidimensional and agents on the other side are uni-dimensional. Lastly, we analyze several examples, including an hedonic model with differentiated products, a marriage market model where wives are differentiated in income and fertility, and a competitive variation of the Rochet-Choné problem. In the latter example, we show that the bunching phenomena, observed by Rochet and Choné in the monopoly context, do not occur in the competitive context.
منابع مشابه
Multidimensional Pattern Matching: A Survey
We review some recent algorithms motivated by computer vision. The problem inspiring this research is that of searching an aerial photograph for all appearances of some object. The issues we discuss are local errors, scaling, compression and dictionary matching. We review deterministic serial techniques that are used for multidimensional pattern matching and discuss their strengths and weaknesses.
متن کاملInvariance properties of the multidimensional matching distance in Persistent Topology and Homology
Persistent Topology studies topological features of shapes by analyzing the lower level sets of suitable functions, called filtering functions, and encoding the arising information in a parameterized version of the Betti numbers, i.e. the ranks of persistent homology groups. Initially introduced by considering real-valued filtering functions, Persistent Topology has been subsequently generalize...
متن کاملMatching Two-Dimensional Articulated Shapes Using Generalized Multidimensional Scaling
We present a theoretical and computational framework for matching of two-dimensional articulated shapes. Assuming that articulations can be modeled as near-isometries, we show an axiomatic construction of an articulation-invariant distance between shapes, formulated as a generalized multidimensional scaling (GMDS) problem and solved efficiently. Some numerical results demonstrating the accuracy...
متن کاملEfficient Pattern Matching of Multidimensional Sequences
We address the problem of the similarity search in large multidimensional sequence databases. Most of previous work focused on similarity matching and retrieval of one-dimensional sequences. However, many new applications such as weather data or music databases need to handle multidimensional sequences. In this paper, we present the efficient search method for finding similar sequences to a giv...
متن کاملPattern Matching in Multidimensional Time Series
Based on the algorithm for pattern matching in a character string, a pattern description language (PDL) is developed. The compilation of a regular expression, that conforms to the PDL, creates a nondeterministic pattern matching machine (PMM) that can be used as a searching device for detecting sequential patterns or functional (statistical) relationships in multidimensional data. As an example...
متن کاملA New Matching Algorithm for Multidimensional Persistence
An algorithm is presented that constructs an acyclic partial matching on the cells of a given simplicial complex from a vector-valued function defined on the vertices and extended to each simplex by taking the least common upper bound of the values on its vertices. The resulting acyclic partial matching may be used to construct a reduced filtered complex with the same multidimensional persisten...
متن کامل